A New Public Key Encryption with Conjunctive Field Keyword Search Scheme

نویسندگان

  • Min-Shiang Hwang
  • Shih-Ting Hsu
  • Cheng-Chi Lee
چکیده

The scheme that searching over the encrypted data, which is also named conjunctive keyword searchable scheme, enables one to search the encrypted data by using conjunctive keywords. The concept was first presented by Golle et al., and then Park et al. extended their scheme into a public key system. According to the existing conjunctive keyword searchable schemes and the assumption that Golle et al. proposed, there are two types: the fixed keyword field scheme and the variable keyword field scheme. However, there are still rooms for both kinds of the schemes to improve both the performance and the security. In this paper, we propose an efficient secure channel free public key encryption with conjunctive field keyword search scheme that can stand against the off-line keyword-guessing attacks, which is more suitable for the weak devices used by users.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Public Key Encryption with Conjunctive Field Free Keyword Search Scheme

Searchable encryption allows a remote server to search over encrypted documents without knowing the sensitive data contents. Prior searchable symmetric encryption schemes focus on single keyword search. Conjunctive Keyword Searches (CKS) schemes improve system usability by retrieving the matched documents. In this type of search, the user has to repeatedly perform the search protocol for many t...

متن کامل

A Study of Conjunctive Keyword Searchable Schemes

We study the development of conjunctive keyword searchable scheme which enables one to search encrypted documents by using more than one keyword. The notion of conjunctive keyword searching was presented by Golle et al. in 2004. However, their security model was constructed in a symmetric-key setting which is not applicable for the overall applications in the reality. So Park et al. extended Go...

متن کامل

Searchable Keyword-Based Encryption

To solve the problem of searching on encrypted data, many keyword search schemes have been proposed in recent years. The goal of such schemes is to enable a user to give an untrusted storage server the ability only to test whether an encrypted document contains a few keywords without learning anything else about the document. In this paper, we are concerned with decrypting the searched results ...

متن کامل

Public Key Encryption with Keyword Search Based on K-Resilient IBE

An encrypted email is sent from Bob to Alice. A gateway wants to check whether a certain keyword exists in an email or not for some reason (e.g. routing). Nevertheless Alice does not want the email to be decrypted by anyone except her including the gateway itself. This is a scenario where public key encryption with keyword search (PEKS) is needed. In this paper we construct a new scheme (KR-PEK...

متن کامل

Expressive and Secure Searchable Encryption in the Public Key Setting

Searchable encryption allows an untrusted server to search on encrypted data without knowing the underlying data contents. Traditional searchable encryption schemes focus only on single keyword or conjunctive keyword search. Several solutions have been recently proposed to design more expressive search criteria, but most of them are in the setting of symmetric key encryption. In this paper, bas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ITC

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2014